A formal approach to Perception Calculus of Zadeh by means of rough mereological logic

نویسنده

  • Lech Polkowski
چکیده

Rough set theory is a paradigm for approximate reasoning based on the assumption that concepts are divided into exact and non–exact (called also rough) ones by means of a topological structure induced by a representation of knowledge as a classification. A classification in its most simple form is an equivalence relation on a universe of objects; the classification induces a partition topology and concepts (meant as subsets of the universe) that are clopen are exact whereas other concepts are rough. In consequence, rough sets are represented as pairs of exact sets of the form (interior, closure). Investigations into deeper structures resulting from that assumption have led to an idea of rough mereology. On this ground also possibility for intensional many–valued logics has been recognized that have been called rough mereological logics. In this contribution, we present a development of rough mereological logics and we propose an application for these logics as a framework within which Calculus of Perceptions outlined by Zadeh may be given a formal rendering as a tool for semantic interpretation of vague statements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Reasoning about Complex Objects in Distributed Systems: Rough Mereological Formalization ?

We propose an approach to approximate reasoning by systems of intelligent agents based on the paradigm of rough mereology. In this approach, the knowledge of each agent is formalized as an information system (a data table) from which similarity measures on objects manipulated by this agent are inferred. These similarity measures are based on rough mereological inclusions which formally render d...

متن کامل

Rough Mereological Controller

We propose a uniied formal treatment of problems of control in distributed systems of intelligent agents. Our approach is rooted in rough set theory and we propose rough mereology as a foundational basis for our approach. We present a general structure of rough mereological controller.

متن کامل

Rough Mereological Foundations for Design , Analysis , Synthesis , and Con - trol in Distributed

We propose a uniied formal treatment of problems of design, analysis, synthesis and control in distributed systems of intelligent agents. Our approach is rooted in rough set theory and we propose rough mereology as a foundational basis for our approach.

متن کامل

Reasoning about Concepts by Rough Mereological Logics

Rough mereology allows for similarity measures (called rough inclusions) which in turn form a basis for the mechanism of granulation of knowledge. Granules of knowledge, defined as classes of satisfactorily similar objects, can be regarded as worlds in which properties of entities are evaluated. Obtained in this way granular rough mereological intensional logics reveal essential properties of r...

متن کامل

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006